A finitely presented orderable group with insoluble word problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finitely presented group whose word problem has sampleable hard instances

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More precisely the problem has a complexity core sampleable in linear time.

متن کامل

The Word Problem for Finitely Presented Quandles is Undecidable

This work presents an algorithmic reduction of the word problem for recursively presented groups to the word problem for recursively presented quandles. The faithfulness of the reduction follows from the conjugation quandle construction on groups. It follows that the word problem for recursively presented quandles is not effectively computable, in general. This article also demonstrates that a ...

متن کامل

A Finitely Presented Torsion-free Simple Group

We construct a finitely presented torsion-free simple group Σ0, acting cocompactly on a product of two regular trees. An infinite family of such groups has been introduced by Burger-Mozes ([2, 4]). We refine their methods and get Σ0 as an index 4 subgroup of a group Σ < Aut(T12)×Aut(T8) presented by 10 generators and 24 short relations. For comparison, the smallest virtually simple group of [4,...

متن کامل

A Finitely Presented Group with Two Non-Homeomorphic asymptotic Cones

We give an example of a finitely presented group G with two non-π 1-equivalent asymptotic cones.

متن کامل

A Slick Proof of the Unsolvability of the Word Problem for Finitely Presented Groups

A famous theorem of P. Novikov 1955 and W. W. Boone 1959 asserts the existence of a finitely presented group with unsolvable word problem. In my Spring 2005 topics course (MATH 574, Topics in Mathematical Logic), I presented Boone’s proof, as simplified by J. L. Britton, 1963. In this seminar I shall present a truly slick, streamlined proof, due to S. Aanderaa and D. E. Cohen, 1980. Instead of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the London Mathematical Society

سال: 2011

ISSN: 0024-6093

DOI: 10.1112/blms/bdr070